The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach

In this paper, we focus on a problem that requires the location of recharging stations and routing electric vehicles in goods distribution system. The are disseminated from depot distributed to customers via heterogeneous fleet with limited capacity. Differently classical vehicle problem, have battery restrictions need be recharged at some if trip is longer than their range. reduces finding optimal locations number minimize total cost, which includes fixed costs opening operating vehicles. We propose novel mathematical formulation an efficient Benders decomposition algorithm embedded into two-phase general framework solve environmental logistics problem. Phase I solves restricted provide upper bound for original later solved II. Between two phases, intermediate processing procedure introduced reduce computations II This achieved by combination several lower bounds obtained exploiting underlying network structure. Our approach setting non-identical allowing multiple visits partial recharging. computational study provides both managerial methodological insights.